Finding maximal 2-dimensional palindromes
نویسندگان
چکیده
منابع مشابه
Finding Maximal 2-Dimensional Palindromes
This paper extends the problem of palindrome searching into a higher dimension, addressing two definitions of 2D palindromes. The first definition implies a square, while the second definition (also known as a centrosymmetric factor), can be any rectangular shape. We describe two algorithms for searching a 2D text for maximal palindromes, one for each type of 2D palindrome. The first algorithm ...
متن کاملCounting and Verifying Maximal Palindromes
A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is represented by a pair (c, r), where c is the center and r is the radius of the palindrome. We say that two strings w and z are pal-distinct if Pals(w) 6= Pals(z). Firstly, we describe the number of pal-distinct strings, and show...
متن کاملFinding Palindromes: Variants and Algorithms
The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. Th...
متن کاملFinding All Approximate Gapped Palindromes
We study the problem of finding all maximal approximate gapped palindromes in a string. More specifically, given a string S of length n, a parameter q ≥ 0 and a threshold k > 0, the problem is to identify all substrings in S of the form uvw such that (1) the Levenshtein distance between u and w is at most k, where w is the reverse of w and (2) v is a string of length q. The best previous work r...
متن کاملFinding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de nition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size n on a xed alphabet, runs in O(kn) time. We also discuss two implementationrelated improvement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2019
ISSN: 0890-5401
DOI: 10.1016/j.ic.2019.03.001